Error bounds for nondifferentiable convex inequalities under a strong Slater constraint qualification
نویسنده
چکیده
A global error bound is given on the distance between an arbitrary point in the n-dimensional real space R n and its projection on a nonempty convex set determined by m convex, possibly nondiierentiable, inequalities. The bound is in terms of a natural residual that measures the violations of the inequalities multiplied by a new simple condition constant that embodies a single strong Slater constraint qualiication (CQ) which implies the ordinary Slater CQ. A very simple bound on the distance to the projection relative to the distance to a point satisfying the ordinary Slater CQ is given rst and then used to derive the principal global error bound. Abbreviated Title. Error bounds under a strong Slater CQ
منابع مشابه
Global Error Bounds for Systems of Convex Polynomials over Polyhedral Constraints
This paper is devoted to study the Lipschitzian/Holderian type global error bound for systems of many finitely convex polynomial inequalities over a polyhedral constraint. Firstly, for systems of this type, we show that under a suitable asymtotic qualification condition, the Lipschitzian type global error bound property is equivalent to the Abadie qualification condition, in particular, the Lip...
متن کاملCharacterization of Properly Efficient Solutions for Convex Multiobjective Programming with Nondifferentiable vanishing constraints
This paper studies the convex multiobjective optimization problem with vanishing constraints. We introduce a new constraint qualification for these problems, and then a necessary optimality condition for properly efficient solutions is presented. Finally by imposing some assumptions, we show that our necessary condition is also sufficient for proper efficiency. Our results are formula...
متن کاملStrong conical hull intersection property, bounded linear regularity, Jameson's property (G), and error bounds in convex optimization
The strong conical hull intersection property and bounded linear regularity are properties of a collection of finitely many closed convex intersecting sets in Euclidean space. These fundamental notions occur in various branches of convex optimization (constrained approximation, convex feasibility problems, linear inequalities, for instance). It is shown that the standard constraint qualificatio...
متن کاملOn Constraint Qualification for an Infinite System of Convex Inequalities in a Banach Space
For a general infinite system of convex inequalities in a Banach space, we study the basic constraint qualification and its relationship with other fundamental concepts, including various versions of conditions of Slater type, the Mangasarian–Fromovitz constraint qualification, as well as the Pshenichnyi–Levin–Valadier property introduced by Li, Nahak, and Singer. Applications are given in the ...
متن کاملRobust linear semi-infinite programming duality under uncertainty
In this paper, we propose a duality theory for semi-infinite linear programming problems under uncertainty in the constraint functions, the objective function, or both, within the framework of robust optimization. We present robust duality by establishing strong duality between the robust counterpart of an uncertain semi-infinite linear program and the optimistic counterpart of its uncertain La...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Program.
دوره 83 شماره
صفحات -
تاریخ انتشار 1998